﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NUnit.Framework;
using NStl.Collections;
using NStl.NUnit.Support;
using NStl.SyntaxHelper;
using System.Collections;
using NUnit.Framework.SyntaxHelpers;

namespace NStl.NUnit.AlgorithmFixtures.InplaceMerge
{
    [TestFixture]
    public class InplaceMergeWithPredicateFixture
    {
        [Test]
        public void SuccessfullPass()
        {
            Vector<int> range = new Vector<int>(0, 2, 4, 1, 3, 5);
            
            Algorithm.InplaceMerge(range.Begin(), range.Begin() + 3, range.End(), Compare.Less<int>());

            ICollection expected = new int[] {0, 1, 2, 3, 4, 5};

            Assert.That(range, Is.EqualTo(expected));
        }
        [Test]
        public void IsStable()
        {
            IdentifiableInteger i0 = new IdentifiableInteger(0);
            IdentifiableInteger i1 = new IdentifiableInteger(1);
            IdentifiableInteger i2 = new IdentifiableInteger(2);
            IdentifiableInteger i3 = new IdentifiableInteger(3);
            IdentifiableInteger i4 = new IdentifiableInteger(4);
            IdentifiableInteger i5_1 = new IdentifiableInteger(5);
            IdentifiableInteger i5_2 = new IdentifiableInteger(5);

            Vector<IdentifiableInteger> range = new Vector<IdentifiableInteger>(i0, i2, i4, i1, i3, i5_1, i5_2);

            Algorithm.InplaceMerge(range.Begin(), range.Begin() + 3, range.End(), Compare.Less<IdentifiableInteger>());

            IUnaryFunction<IdentifiableInteger, int> extractId =
                Functional.PtrFun<IdentifiableInteger, int>(delegate(IdentifiableInteger i) { return i; });

            IBinaryFunction<IdentifiableInteger, IdentifiableInteger, bool> lessById = 
                Compose.FGxHy(Compare.Less<int>(), extractId, extractId);

            bool isSortedById = Algorithm.IsSorted(range.Begin(), range.End(), lessById);

            Assert.That(isSortedById, Is.True);
        }
        [Test]
        public void RangeIsAllreadySorted()
        {
            Vector<int> range = new Vector<int>(0, 1, 2, 3, 4);

            Algorithm.InplaceMerge(range.Begin(), range.Begin() + 2, range.End(), Compare.Less<int>());

            ICollection expected = new int[] { 0, 1, 2, 3, 4 };

            Assert.That(range, Is.EqualTo(expected));
        }
        [Test]
        public void StartIteratorIsEqualToMiddleIterator()
        {
            Vector<int> range = new Vector<int>(1, 3, 5);

            Algorithm.InplaceMerge(range.Begin(), range.Begin(), range.End(), Compare.Less<int>());

            ICollection expected = new int[] {1, 3, 5};

            Assert.That(range, Is.EqualTo(expected));
        }
        [Test]
        public void MiddleIteratorIsEqualToEndIterator()
        {
            Vector<int> range = new Vector<int>(1, 3, 5);

            Algorithm.InplaceMerge(range.Begin(), range.End(), range.End(), Compare.Less<int>());

            ICollection expected = new int[] { 1, 3, 5 };

            Assert.That(range, Is.EqualTo(expected));
        }
    }
}
